Exploiting Web-Derived Selectional Preference to Improve Statistical Dependency Parsing
نویسندگان
چکیده
In this paper, we present a novel approach which incorporates the web-derived selectional preferences to improve statistical dependency parsing. Conventional selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This paper extends previous work to wordto-word selectional preferences by using webscale data. Experiments show that web-scale data improves statistical dependency parsing, particularly for long dependency relationships. There is no data like more data, performance improves log-linearly with the number of parameters (unique N-grams). More importantly, when operating on new domains, we show that using web-derived selectional preferences is essential for achieving robust performance.
منابع مشابه
Domain Adaptation of a Dependency Parser with a Class-Class Selectional Preference Model
When porting parsers to a new domain, many of the errors are related to wrong attachment of out-of-vocabulary words. Since there is no available annotated data to learn the attachment preferences of the target domain words, we attack this problem using a model of selectional preferences based on domainspecific word classes. Our method uses Latent Dirichlet Allocations (LDA) to learn a domain-sp...
متن کاملCmpt 825: Natural Language Processing 1.1 Hiding a Semantic Hierarchy in a Markov Model [1] 1.1.1 General Concepts
We know that in logic a predicate is a relation between its arguments. In other words, a predicate defines constraints between its arguments. A predicate ρ(v, r, c) is called selectional restriction where v is a verb, r is a role or an object and c is called a class which is a noun. Selectional preference σ : (v, r, c) → a is a function of these predicates to a real number. Where a shows the de...
متن کاملThe Impact of Selectional Preference Agreement on Semantic Relational Similarity
Relational similarity is essential to analogical reasoning. Automatically determining the degree to which a pair of words belongs to a semantic relation (relational similarity) is greatly improved by considering the selectional preferences of the relation. To determine selectional preferences, we induced semantic classes through a Latent Dirichlet Allocation (LDA) method that operates on depend...
متن کاملGenerative Modeling of Coordination by Factoring Parallelism and Selectional Preferences
We present a unified generative model of coordination that considers parallelism of conjuncts and selectional preferences. Parallelism of conjuncts, which frequently characterizes coordinate structures, is modeled as a synchronized generation process in the generative parser. Selectional preferences learned from a large web corpus provide an important clue for resolving the ambiguities of coord...
متن کاملTransition-based Dependency Parsing with Selectional Branching
We present a novel approach, called selectional branching, which uses confidence estimates to decide when to employ a beam, providing the accuracy of beam search at speeds close to a greedy transition-based dependency parsing approach. Selectional branching is guaranteed to perform a fewer number of transitions than beam search yet performs as accurately. We also present a new transition-based ...
متن کامل